4-regular integral graphs avoiding ±3 in the spectrum
نویسندگان
چکیده
منابع مشابه
Nonexistence of Some 4-regular Integral Graphs
A graph is called integral if all its eigenvalues are integers. The quest for integral graphs was initiated by F. Harary and A. J. Schwenk [9]. All such cubic graphs were obtained by D. Cvetković and F. C. Bussemaker [2, 1], and independently by A. J. Schwenk [10]. There are exactly thirteen cubic integral graphs. In fact, D. Cvetković [2] proved that the set of regular integral graphs of a fix...
متن کاملRegular integral sum graphs
Given a set of integers S; G(S) = (S; E) is a graph, where the edge uv exists if and only if u+ v∈ S. A graph G = (V; E) is an integral sum graph or ISG if there exists a set S ⊂ Z such that G=G(S). This set is called a labeling of G. The main results of this paper concern regular ISGs. It is proved that all 2-regular graphs with the exception of C4 are integral sum graphs and that for every po...
متن کاملSome 3 - regular 4 - ordered graphs ∗
A graph G is k-ordered if for any sequence of k distinct vertices v1, v2, . . . , vk of G there exists a cycle in G containing these k vertices in the specified order. In 1997, Ng and Schultz posed the question of the existence of 3-regular 4-ordered graphs other than K4 and K3,3. In 2008, Meszaros solve the question by proving the Petersen graph and the Heawood graph are 3-regular 4-ordered gr...
متن کاملOn 3-regular 4-ordered graphs
A simple graph G is k-ordered (respectively, k-ordered hamiltonian), if for any sequence of k distinct vertices v1, . . . , vk of G there exists a cycle (respectively, hamiltonian cycle) in G containing these k vertices in the specified order. In 1997 Ng and Schultz introduced these concepts of cycle orderability and posed the question of the existence of 3-regular 4-ordered (hamiltonian) graph...
متن کاملOn 4-ordered 3-regular graphs
A graph G is k-ordered if for any sequence of k distinct vertices v1, v2, . . . , vk of G there exists a cycle in G containing these k vertices in the specified order. In 1997, Ng and Schultz posed the question of the existence of 4-ordered 3-regular graphs other than the complete graph K4 and the complete bipartite graph K3,3. In 2008, Meszaros solved the question by proving that the Petersen ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Publikacije Elektrotehnickog fakulteta - serija: matematika
سال: 2003
ISSN: 0353-8893
DOI: 10.2298/petf0314099s